Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery
نویسندگان
چکیده
A convex variational formulation is proposed to solve multicomponent signal processing problems in Hilbert spaces. The cost function consists of a separable term, in which each component is modeled through its own potential, and of a coupling term, in which constraints on linear transformations of the components are penalized with smooth functionals. An algorithm with guaranteed weak convergence to a solution to the problem is provided. Various multicomponent signal decomposition and recovery applications are discussed. 1 Problem statement The processing of multicomponent signals has become increasingly important due, on the one hand, to the development of new imaging modalities and sensing devices, and, on the other hand, to the introduction of sophisticated mathematical models to represent complex signals. It is for instance required in applications dealing with the recovery of multichannel signals [8, 33, 34, 40], which arise in particular in color imaging and in the multiand hyperspectral imaging techniques used in astronomy and in satellite imaging. Another important instance of multicomponent processing is found 1 in signal decomposition problems, e.g., [2, 5, 6, 7, 15, 43, 44]. In such problems, the ideal signal is viewed as a mixture of elementary components that need to be identified individually. Mathematically, a multicomponent signal can be viewed as an m-tuple (xi)1≤i≤m, where each component xi lies in a real Hilbert space Hi. A generic convex variational formulation for solving multicomponent signal recovery or decomposition problems is minimize x1∈H1,..., xm∈Hm Φ(x1, . . . , xm), (1.1) where Φ: H1 ⊕ · · · ⊕Hm → ]−∞,+∞] is a convex cost function. At this level of generality, however, no algorithm exists to solve (1.1) reliably in the sense that it produces m sequences (x1,n)n∈N, . . . , (xm,n)n∈N converging (weakly or strongly) to points x1, . . . , xm, respectively, such that (xi)1≤i≤m minimizes Φ. Let us recall that, even in the elementary case when m = 2 and H1 = H2 = R, the basic Gauss-Seidel alternating minimization algorithm does not possess this property [28]. In this paper, we consider the following, more structured version of (1.1). Problem 1.1 Let m ≥ 2 and p ≥ 1 be integers, let (Hi)1≤i≤m and (Gk)1≤k≤p be real Hilbert spaces, and let (τk)1≤k≤p be in ]0,+∞[. For every i ∈ {1, . . . ,m}, let fi : Hi → ]−∞,+∞] be a proper lower semicontinuous convex function and, for every k ∈ {1, . . . , p}, let φk : Gk → R be convex and differentiable with a τk–Lipschitz continuous gradient, and let Lki : Hi → Gk be linear and bounded. It is assumed that min1≤k≤p ∑m i=1 ‖Lki‖ > 0. The problem is to minimize x1∈H1,..., xm∈Hm m ∑
منابع مشابه
$(varphi_1, varphi_2)$-variational principle
In this paper we prove that if $X $ is a Banach space, then for every lower semi-continuous bounded below function $f, $ there exists a $left(varphi_1, varphi_2right)$-convex function $g, $ with arbitrarily small norm, such that $f + g $ attains its strong minimum on $X. $ This result extends some of the well-known varitional principles as that of Ekeland [On the variational principle, J. Ma...
متن کاملA Douglas-Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery
Under consideration is the large body of signal recovery problems that can be formulated as the problem of minimizing the sum of two (not necessarily smooth) lower semicontinuous convex functions in a real Hilbert space. This generic problem is analyzed and a decomposition method is proposed to solve it. The convergence of the method, which is based on the Douglas-Rachford algorithm for monoton...
متن کاملEmpirical mode decomposition revisited by multicomponent non-smooth convex optimization
This work deals with the decomposition of a signal into a collection of intrinsic mode functions. More specifically, we aim to revisit Empirical Mode Decomposition (EMD) based on a sifting process step, which highly depends on the choice of an interpolation method, the number of inner iterations, and that does not have any convergence guarantees. The proposed alternative to the sifting process ...
متن کاملDomain decomposition for a non-smooth convex minimization problem and its application to plasticity
P.L. Lions's work on the Schwarz alternating method for convex minimization problems is generalized to a certain non-smooth situation where the non-diierentiable part of the functionals is additive and independent with respect to the decomposition. Such functionals arise naturally in plasticity where the material law is a variational inequality formulated in L 2 ((). The application to plastici...
متن کاملProximal Thresholding Algorithm for Minimization over Orthonormal Bases
The notion of soft thresholding plays a central role in problems from various areas of applied mathematics, in which the ideal solution is known to possess a sparse decomposition in some orthonormal basis. Using convex-analytical tools, we extend this notion to that of proximal thresholding and investigate its properties, providing in particular several characterizations of such thresholders. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009